Traceability on RSA-based partially signature with low computation
نویسندگان
چکیده
In this article, we show that the Chien et al. s partially blind signature scheme based on RSA public cryptosystem could not meet the untraceability property of a blind signature. 2002 Elsevier Inc. All rights reserved.
منابع مشابه
Voting With a Tripartite Designated Verifier Scheme Based On Threshold RSA Signatures
In this paper we propose a new voting scheme that provides a receipt to each voters. The receipt is build in a way that prevents that the vote can be revealed to third entities other than a judge. The scheme is based on the concept of strong designated verifier signature scheme and threshold RSA signatures. The signing key size remains bounded by the size of a RSA modulus. The computational cos...
متن کاملAn Exploitation of Blind Signature Schemes to Simulate Privacy-related Applications
This paper presents the simulation of privacy-related applications employing blind signature (BS) schemes. Two popular privacy-related applications: 'traditional BS based electronic voting system (EVS)' and 'traditional offline electronic payment protocol (EPP)' have been chosen here. A BS scheme is a cryptographic protocol that plays a vital role to conduct the electronic t...
متن کاملA Tripartite Strong Designated Verifier Scheme Based On Threshold RSA Signatures
In this paper we propose a new designated verifier signature scheme based on the threshold signature scheme presented [9] by Ghodosi and Pieprzyk. The advantages of the new scheme compared with previously proposed solutions are its computational efficiency and its simple and rational design that allows distributed implementations of the computations and suits the needs of both single individual...
متن کاملIdentity Based Proxy Signature from RSA without Pairings
RSA is a key cryptography technique and provides various interfaces for the applied software in real-life scenarios. Although some good results were achieved in speeding up the computation of pairing function in recent years, the computation cost of the pairings is much higher than that of the exponentiation in a RSA group. So it is still interesting to design efficient cryptosystems based on R...
متن کاملReview on Credential Systems in Anonymizing Networks
A credential system is a system in which users can obtain credentials from organizations and reveal possession of these credentials. This system is called anonymous when transactions carried out by the same user cannot be linked. In this paper we are describing few such credential systems. Nymble is a credential system in which servers themselves can blacklist misbehaving users, and thus blocks...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Applied Mathematics and Computation
دوره 145 شماره
صفحات -
تاریخ انتشار 2003